BEEM : Bucket Elimination with External Memory
نویسندگان
چکیده
A major limitation of exact inference algorithms for probabilistic graphical models is their extensive memory usage, which often puts real-world problems out of their reach. In this paper we show how we can extend inference algorithms, particularly Bucket Elimination, a special case of cluster (join) tree decomposition, to utilize disk memory. We provide the underlying ideas and show promising empirical results of exactly solving large problems not solvable before.
منابع مشابه
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolution for propositional satis ability, adaptive-consistency for constraint satisfaction, Fourier and Gaussian elimination for solving linear equalities and inequalities, and dynamic programming for combinatorial optimiza...
متن کاملBucket Elimination: a Unifying Framework for Structure-driven Inference
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many complex problem-solving and reasoning tasks. Algorithms such as directional-resolution for proposi-tional satissability, adaptive-consistency for constraint satisfaction, Fourier and Gaussian elimination, for solving linear equalities and inequalities and dynamic programming for combinatorial...
متن کاملBranch and Bound with Mini-Bucket Heuristics
The paper describes a new generic branch and bound scheme that uses heuristics generated mechanically by the mini-bucket approximation. The scheme is presented and evaluated for the Most Probable Explanation (MPE) task in Bayesian networks. We show that the mini-bucket scheme yields monotonic heuristics of varying strengths which cause different amounts of pruning during search. The resulting B...
متن کاملUsing Constraints with Memory to Implement Variable Elimination
Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and produces an equivalent network with one less variable and one new constraint (the join of the variable bucket). This process is iterated until every variable is eliminated, and then all solutions can be computed without backtracking. A direct, naive imple...
متن کاملQuery-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search
Locality-Sensitive Hashing (LSH) and its variants are the well-known indexing schemes for the c-Approximate Nearest Neighbor (c-ANN) search problem in high-dimensional Euclidean space. Traditionally, LSH functions are constructed in a query-oblivious manner in the sense that buckets are partitioned before any query arrives. However, objects closer to a query may be partitioned into different bu...
متن کامل